//LuoFeng Nanami ver.
#include<bits/stdc++.h>
#define ll long long
#define rll register ll
#define F(i, a, b) for(rll i = a; i <= b; i++)
#define Fdn(i, a, b) for(rll i = a; i >= b; i--)
#define int ll
#define ld long double
#define pii pair<int, int>
#define fi first
#define se second

using namespace std;
const int inf = 0x3f3f3f3f3f3f3f3f, mod = 1e9 + 7, _mod = 998244353;
const int maxn = 1e5 + 7;

int n, buc[maxn], num;
int ans;

signed main() {
    freopen("duel.in", "r", stdin);
    freopen("duel.out", "w", stdout);

    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    cin >> n;
    F(i, 1, n) { cin >> num; buc[num]++; }
    F(i, 1, maxn - 7) {
        ans = buc[i] + max(0ll, ans - buc[i]);
    }
    cout << ans;

    return 0;
}

//14:47